Exploiting the structure of autoregressive processes in chance-constrained multistage stochastic linear programs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exploiting the structure of autoregressive processes in chance-constrained multistage stochastic linear programs

We consider an interstage dependent stochastic process whose components follow an autoregressive model with time varying order. At a given time, we give some recursive formulæ linking future values of the process with past values and noises. We then consider multistage stochastic linear programs with uncertain sets depending affinely on such processes. At each stage, dealing with uncertainty us...

متن کامل

Distributionally robust chance-constrained linear programs

In this paper, we discuss linear programs in which the data that specify the constraints are subject to random uncertainty. A usual approach in this setting is to enforce the constraints up to a given level of probability. We show that for a wide class of probability distributions (i.e. radial distributions) on the data, the probability constraints can be explicitly converted into convex second...

متن کامل

Scalable Heuristics for a Class of Chance-Constrained Stochastic Programs

Stochastic Programs Jean-Paul Watson Discrete Math and Complex Systems Department, Sandia National Laboratories, Albuquerque, NM 87185-1318, [email protected] Roger J-B Wets Department of Mathematics, University of California, Davis, Davis, CA 95616-8633, [email protected] David L. Woodruff Graduate School of Management, University of California, Davis, Davis, CA 95616-8609, dlwoodruff@ucdav...

متن کامل

Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs

We propose two new Lagrangian dual problems for chance-con-strained stochastic programs based on relaxing nonanticipativity constraints. We compare the strength of the proposed dual bounds and demonstrate that they are superior to the bound obtained from the continuous relaxation of a standard mixed-integer programming (MIP) formulation. For a given dual solution, the associated Lagrangian rela...

متن کامل

Solving Chance-Constrained Stochastic Programs via Sampling and Integer Programming

Various applications in reliability and risk management give rise to optimization problems with constraints involving random parameters, which are required to be satisfied with a pre-specified probability threshold. There are two main difficulties with such chance-constrained problems. First, checking feasibility of a given candidate solution exactly is, in general, impossible since this requir...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Operations Research Letters

سال: 2012

ISSN: 0167-6377

DOI: 10.1016/j.orl.2012.09.001